Some unsymmetric combinatorial numbers

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Congruences for Some Combinatorial Numbers via Finite Automata

Finite automata can be useful for proving the congruences for combinatorial numbers. We offer several examples as applications: First we consider the congruence of central Delannoy numbers module 3, then we find the congruences of the number of graphs and the number of total edges for noncrossing connected graphs module 3. One of these results answers a conjecture of Deutsch and Sagan in affirm...

متن کامل

Some combinatorial aspects of finite Hamiltonian groups

In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...

متن کامل

Some Combinatorial Principles

We extend some large cardinal axioms of Jensen to weakly inaccessible cardinals. Related problems regarding the saturatedness of certain filters are also studied.

متن کامل

Combinatorial Proofs of Some Identities for the Fibonacci and Lucas Numbers

We study the previously introduced bracketed tiling construction and obtain direct proofs of some identities for the Fibonacci and Lucas numbers. By adding a new type of tile we call a superdomino to this construction, we obtain combinatorial proofs of some formulas for the Fibonacci and Lucas polynomials, which we were unable to find in the literature. Special cases of these formulas occur in ...

متن کامل

Some Tractable Combinatorial Auctions

Auctions are the most widely used strategic gametheoretic mechanism in the Internet. Auctions have been mostly studied from a game-theoretic and economic perspective, although recent work in AI and OR has been concerned with computational aspects of auctions as well. When faced from a computational perspective, combinatorial auctions are perhaps the most challenging type of auctions. Combinator...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the American Mathematical Society

سال: 1966

ISSN: 0002-9904

DOI: 10.1090/s0002-9904-1966-11522-7